Note a Reduction of Semigroup Dlp to Classic Dlp

نویسنده

  • MATAN BANIN
چکیده

We present a polynomial-time reduction of the discrete logarithm problem in any periodic (a.k.a. torsion) semigroup (Semigroup DLP) to the classic DLP in a subgroup of the same semigroup. It follows that Semigroup DLP can be solved in polynomial time by quantum computers, and that Semigroup DLP has subexponential algorithms whenever the classic DLP in the corresponding groups has subexponential algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A reduction of Semigroup DLP to classic DLP

We present a polynomial-time reduction of the discrete logarithm problem in any periodic (a.k.a. torsion) semigroup (Semigroup DLP) to the classic DLP in a subgroup of the same semigroup. It follows that Semigroup DLP can be solved in polynomial time by quantum computers, and that Semigroup DLP has subexponential algorithms whenever the classic DLP in the corresponding groups has subexponential...

متن کامل

Effects of Different Levels of Dried Lemon (Citrus aurantifulia) Pulpon Performance, Carcass Traits, Blood Biochemical and Immunity Parameters of Broilers

This experiment was conducted to evaluate the effects of different levels of dried lemon pulp (DLP) on performance, carcass traits, blood biochemical and immunity parameters of broilers. In this experiment 240 of broilers (Ross-308) were used in a completely randomized design with 4 treatments and 3 replicates (with 20 birds in each replicate) from 1 to 42 days. Experimental diets included: 1) ...

متن کامل

Design and implementation of aggregate functions in the DLV system

Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows for expressing every property of finite structures that is decidable in the complexity class Σ2(=NP ). Despite this high expressiveness, there are some simple properties, often arising in real-world applications, which cannot be encoded in a simple and natural manner. Especially properties that require the use of arit...

متن کامل

Optimizing a multiple criteria dynamic layout problem using a simultaneous data envelopment analysis modeling Optimizing a DLP using DEA

The main characteristic of today’s manufacturing environments is volatility. Under such a volatile environment some parameters like demand is not stable. To operate efficiently under such environments, the facilities must be adaptive to change production requirements. From a layout point of view, this situation requires the solution of the dynamic layout problem (DLP). Layout design has a signi...

متن کامل

Aggregate Functions in DLV

Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows for expressing every property of finite structures that is decidable in the complexity class . Despite this high expressiveness, there are some simple properties, often arising in real-world applications, which cannot be encoded in a simple and natural manner. Especially properties that require the use of arithmetic o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013